Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes ⩽k and =k

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes

We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which characterize programmed grammars with the finite index restriction; looking at the number of components of such systems, we obtain surprisingly rich lattice st...

متن کامل

Bidirectional Cooperating Distributed Grammar Systems Bidirectional Cooperating Distributed Grammar Systems

We consider bidirectional cooperating distributed (BCD) grammar systems in the sense of Asveld. Independently of their mode , , =, , or t, BCD grammar systems with two components characterize the re-cursively enumerable languages even with right-linear rules and without-productions. This sharply contrasts earlier results on solely generating or accepting grammars, where right-linear rules alway...

متن کامل

Reliability Analysis of K-Out-Of N: G Machining Systems with Mixed Spares and Multiple Modes of Failure (TECHNICAL NOTE)

This paper deals with the transient analysis of K-out-of-N: G system consisting of Noperatingmachines. To improve system reliability, Y cold standby and S warm standbys spares areprovided to replace the failed machines. The machines are assumed to fail in multiple modes. At leastK-out-of-N machines for smooth functioning of the system. Reliability and mean time to failure areestablished in term...

متن کامل

Deterministic Cooperating Distributed Grammar Systems

Subclasses of grammar systems that can facilitate parser construction appear to be of interest. In this paper, some syntactical conditions considered for strict deterministic grammars are extended to cooperating distributed grammar systems, restricted to the terminal derivation mode. Two variants are considered according to the level to which the conditions address. The local variant, which int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2003

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(02)00541-8